New Heuristics for Rooted Triplet Consistency
نویسندگان
چکیده
منابع مشابه
New Heuristics for Rooted Triplet Consistency
Rooted triplets are becoming one of the most important types of input for reconstructing rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. In this paper, we investigate the problem of inferring the maximum consensus evolutionary tree from a set of rooted triplets. This problem is known to be AP...
متن کاملNew heuristics on Rooted Triplet Consistency ∗
Rooted triplets are becoming one of the important types of input for reconstructing 1 rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the 2 evolutionary relationship of the corresponding three species. In this paper, we investigate the 3 problem of inferring the maximum consensus evolutionary tree from a set of rooted triplets. 4 The mentioned problem is kn...
متن کاملNew Algorithms on Rooted Triplet Consistency
Rooted triplets are becoming one of the important types of input for reconstructing 1 rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the 2 evolutionary relationship of the corresponding three species. In this paper, we investigate the 3 problem of inferring the maximum consensus evolutionary tree from a set of rooted triplets. 4 The mentioned problem is kn...
متن کاملNew Results on Optimizing Rooted Triplets Consistency
A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related optimization problems called the maximum rooted triplets consistency problem (MaxRTC) and the minimum rooted triplets inconsistency problem (MinRTI) in which the input is a set R of rooted triplets...
متن کاملDomain-Heuristics for Arc-Consistency Algorithms
Arc-consistency algorithms are widely used to prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks (also known as consistency-checks) to find out about the properties of CSPs. They use arc-heuristics to select the next constraint and domain-heuristics to select the next values for their next support-check. We will investigate the effects of domain-heuristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6030396